A new design of Prolog-based bottom-up parsing system with government-binding theory
نویسندگان
چکیده
This paper addresses the problems of movement transformation in Prolog-based bottom-up parsing system. Three principles of Government-Binding theory are employed to deal with these problems. They are Empty Category Principle, C-command Principle, and Subjacency Principle. A formalism based upon them is proposed. Translation algorithms are given to add these linguistic principles to the general grammar rules, the leftward movement grammar rules, and the rightward movement grammar rules respectively. This approach has the following specific features: the uniform treatments of leftward and rightward movements, the arbitrary number of movement non-terminals in the rule body, and automatic detection of grammar errors before parsirlg. An example in Chinese demonstrates all the concepts.
منابع مشابه
A binding rule for government-binding parsing
In this paper I propose a Binding rule for the identification of pronoun and anaphor referents in phrase-structure trees, assuming the general framework of lhe Government-binding theory outlined by Chom,;ky (1981). The Binding rule, specified by means of an attribute grammar, is a particular instantiation of the Free Indexing rule and binding axioms in Chomsky's Binding theory, with certain emp...
متن کاملA Parsing System Based on Logic Programming
The paper presents a practical parsing system based on logic programming. A restricted Def in i te Clause Grammar is assumed as grammar description and the grammar is translated into a parsing program wr i t ten in Prolog. The system employs a bottom-up pars ing s t r a t e g y w i t h top-down p r e d i c t i o n . The m a j o r advantages of our system are that the system works in a bottom-up...
متن کاملDeductive Parsing with Multiple Levels of Representation
This paper discusses a sequence of deductive parsers, called PAD1 PAD5, that utilize an ax iomat iza t ion of the pr inciples and parameters of GB theory, including a restricted transformational component (Move-a). PAD2 uses an inference control strategy based on the "freeze" predicate of Prolog-II, while PAD3 5 utilize the Unfold-Fold transformation to transform the original axiomatization int...
متن کاملA New Perspective of Statistical Modeling by PRISM
PRISM was born in 1997 as a symbolic statistical modeling language to facilitate modeling complex systems governed by rules and probabilities [Sato and Kameya, 1997]. It was the first programming language with EM learning ability and has been shown to be able to cover popular symbolic statistical models such as Bayesian networks, HMMs (hidden Markov models) and PCFGs (probabilistic context free...
متن کاملA PROLOG Implementation of Government-Binding Theory
A number of recent research efforts have explicitly grounded parser design on linguistic theory (e.g., Bayer et al. (1985), Berwick and Weinberg (1984), Marcus (1980), Reyle and Frey (1983), and Wehrli (1983)). Although many of these parsers are based on generative grammar, and transformational grammar in particular, with few exceptions (Wehrli (1983)) the modular approach as suggested by this ...
متن کامل